computation complexityの例文

• The computation complexity increases when going from single column, to single table, to cross-table structural profiling.
• Because simulated annealing relies on random sampling to find improvements, however, its computation complexity is exponential in the number of dimensions being optimized.
• The interest of these two kernels is that they show very different granularity ( the subset tree kernel being far more fine-grained than the subtree kernel ), for the same computation complexity.
• The computation complexity of a problem or an algorithm expressed in terms of the decision tree model is called "'decision tree complexity "'or "'query complexity " '.
• What about something like x 1.57238 ? " Polynomial " might still be accurate in the computation complexity-theoretic sense, but in other contexts ( this is about statistics, if it matters ) it seems to me that it connotes an integer exponent.
• Are those subjects outside the reach of the standard model ( due to relativistic effects ? ), is it " only " a matter of exploding computation complexity or are there principal computational issues ( as in the three-bodies problem of classical mechanic ) ? talk ) 15 : 39, 1 January 2010 ( UTC)